The next 700 relational program logics
نویسندگان
چکیده
منابع مشابه
Relational program logics in decomposed style
Suppose you have developed a Hoare logic for your favorite programming language. You have justified the logic by defining an operational model of the language and constructing a soundness proof that interprets triples as partial correctness assertions. Now you want to interpret program analyses, validate security properties such as noninterference, or justify program transformations. You observ...
متن کاملThe next 700 Krivine machines
The Krivine machine is a simple and natural implementation of the normal weak-head reduction strategy for pure λ-terms. While its original description has remained unpublished, this machine has served as a basis for many variants, extensions and theoretical studies. In this paper, we present the Krivine machine and some well-known variants in a common framework. Our framework consists of a hier...
متن کاملThe next 700 slicing criteria
A slice is constructed by deleting statements from a program whilst preserving some projection of its semantics. Since Mark Weiser introduced program slicing in 1979, a wide variety of slicing paradigms have been proposed, each of which is based upon a new formulation of the slicing criterion, capturing the semantic projection to be preserved during the process of command deletion. This paper s...
متن کاملA Semantic PSPACE Criterion for the Next 700 Rank-0-1 Modal Logics
Upper complexity bounds for modal logics are often a complex issue treated with a wide range of frequently adhoc techniques. As domain-specific modal logics (often non-normal) abound in the literature and new ones appear at regular intervals, it is therefore desirable to develop a generic algorithmic framework for deriving such bounds systematically. Here, we present a semantics-based criterion...
متن کاملThe next 700 reflective object-oriented languages
Since Smith seminal work, there have been numerous reflective language definition and implementation proposals. These proposals, initially restricted to functional languages, have been quickly extended to object-oriented languages. Unfortunately, reflective objectoriented language definitions remained mostly ad hoc. In this paper, we present a generic reification technique which enables the sel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2020
ISSN: 2475-1421
DOI: 10.1145/3371072